S N 2 23 2 - 20 94 , n o . 1 14 9 , M ay 1 7 , 2 01 1
نویسندگان
چکیده
A path in an edge colored graph G is called a rainbow path if all its edges have pairwise different colors. Then G is rainbow connected if there exists a rainbow path between every pair of vertices of G and the least number of colors needed to obtain a rainbow connected graph is the rainbow connection number. If we demand that there must exist a shortest rainbow path between every pair of vertices, we speak about strongly rainbow connected graph and the strong rainbow connection number. In this paper we study the (strong) rainbow connection number on direct, strong, and lexicographic product and present several upper bounds for these products that are attained by many graphs. Several exact results are also obtained.
منابع مشابه
FREZCHEM: A geochemical model for cold aqueous solutions
#,-(!!/%&%*0!1%&%)*23!4-&0#050%6!77.8!1)99#,!:)*;<)=6!1%-,6!>[email protected]!9#$%&(B)*#,-CD*#(%D5(!! ! ! Introduction: E1FGHIF'!#&!)-!%J5#$#K*#5B! 23%B#2)$!03%*B,D=-)B#2!B,D%$!L)*)B%0%*#M%D!N,*! 2,-2%-0*)0%D!%$%20*,$=0%!&,$50#,-&!O0,!#,-#2!&0*%-903&!P! 7Q!BR!5&#-9!03%!:#0M%*!)LL*,)23!S.+7T!N,*!03%!0%BL%*)+ 05*%!*)-9%!N*,B!UVWQ!0,!78XH6!)-D!03%!L*%&&5*%!*)-9%! N*,B!.!0,!.QQQ!K)*&!SYT(!!Z3%!25**%-0![%*&...
متن کاملOn the Zagreb index inequality of graphs with prescribed vertex degrees
For a simple graph G with n vertices and m edges, the inequality M1(G)/n ≤ M2(G)/m, where M1(G) and M2(G) are the first and the second Zagreb indices of G, is known as Zagreb indices inequality. According to this inequality, a set S of integers is good if for every graph whose degrees of vertices are in S, the inequality holds. We characterize that an interval [a, a+n] is good if and only if a ...
متن کاملNon-linear Effects in Asymmetric Catalysis: Whys and Wherefores
It is argued that the titled non-linear effects (NLE) may arise whenever the order of the reaction in the chiral catalyst in greater than 1. In a fundamental departure from previous approaches, this is mathematically elaborated for the second order case. (NLE may also be observed if the chiral catalyst forms non-reacting dimers in a competing equilibrium; practically, however, this implies the ...
متن کاملDECAF Programming: Agents for Undergraduates
! "# $ !%& ' ( ) +*, -. + /0 ) 132 4 2) 657 )-8 :9; <= # > 62 " 1?%@57 A% /0 )1? 7 !%CBED; # + 2) #2) F #2)1?"#% G # . H I # 4J1 /0 1K1? " L "# M4 %M ) ( #% # N2) O" # 2! P ? 2 1 L.QR #<= # S% ( + 5#"M +4 % 1$* L T: #%A M UV 2) ' !B WX $ ZY\[^]; `_aLb9; ' <0 % / 2 I c !%M"#2 # d # e1 / 1^ -F f 2 2)*S ! "# $ !%S9g + 2 2 b I% )/0 1 " + )-8" 1#9; <M h BiWj 57 )1? / " %M ) % " P 32! c ! + # 5#1$*65...
متن کاملA Bibliography of Publications in Designs, Codes, and Cryptography
(28, 12, 11) [117]. (31, 10, 3) [34]. (36, 16, 12) [117]. (49, 9, 6) [142]. (64, 2, 12) [236]. (Ck ⊕G,k, 1) [251]. (G, k, 1) [251]. (m,n) [151]. (m− 1)/pm [167]. (p, p, p, p) [139]. (q, 6, 1) [342]. (v, {2, 4}, 1) [245]. (v, k, λ) [109]. −1 [26]. 0 [102, 205]. {0, 1, 2} [101]. 1 [205]. 15 [102]. 2 [14, 36, 55, 61, 68, 86, 117, 142, 143, 223, 265, 266, 271, 296, 324]. 25 [302]. 27 [93, 120]. 28 ...
متن کامل